Realization of digital optical matrix-vector multiplication
نویسندگان
چکیده
منابع مشابه
Performance of an embedded optical vector matrix multiplication processor architecture
An embedded architecture of optical vector matrix multiplier (OVMM) is presented. The embedded architecture is aimed at optimising the data flow of vector matrix multiplier (VMM) to promote its performance. Data dependence is discussed when the OVMM is connected to a cluster system. A simulator is built to analyse the performance according to the architecture. According to the simulation, Amdah...
متن کاملCombinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture
A new state space representation of a class of combinatorial optimization problems is introduced. The representation enables efficient implementation of exhaustive search for an optimal solution in bounded NP complete problems such as the traveling salesman problem (TSP) with a relatively small number of cities. Furthermore, it facilitates effective heuristic search for sub optimal solutions fo...
متن کاملBalanced Ternary Vector-Matrix Multiplication on a Ternary Optical Computer
This paper proposes an optical method to perform a balanced ternary vector-matrix multiplication. Inspired by ternary optical computer‘s ability to process ternary information, we study techniques to realize ternary vector-matrix multiplication (VMM) based on the work of manipulating binary VMM computation. The principle and specific working flow is described in detail and the correctness of th...
متن کاملFast QMC Matrix-Vector Multiplication
Quasi-Monte Carlo (QMC) rules 1/N ∑N−1 n=0 f(ynA) can be used to approximate integrals of the form ∫ [0,1]s f(yA) dy, where A is a matrix and y is row vector. This type of integral arises for example from the simulation of a normal distribution with a general covariance matrix, from the approximation of the expectation value of solutions of PDEs with random coefficients, or from applications fr...
متن کاملFaster Online Matrix-Vector Multiplication
We consider the Online Boolean Matrix-Vector Multiplication (OMV) problem studied by Henzinger et al. [STOC’15]: given an n× n Boolean matrix M, we receive n Boolean vectors v1, . . . ,vn one at a time, and are required to output Mvi (over the Boolean semiring) before seeing the vector vi+1, for all i. Previous known algorithms for this problem are combinatorial, running in O(n3/ log2 n) time. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics D: Applied Physics
سال: 1995
ISSN: 0022-3727,1361-6463
DOI: 10.1088/0022-3727/28/1/003